منابع مشابه
Negation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملNegation and Double-Negation of Chinese Oppositeness
Oppositeness refers to the paradigmatic relationship of two words holding the contrast meanings. The fact that linguistic opposite differs from logical contrast has been discussed in theories, but has not been tested in practice. In this paper, we investigate three main subtypes of Chinese oppositeness, via using logical tests of negation and double-negation. Result shows that purely logical te...
متن کاملCombining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملSubminimal negation
Minimal Logic, i.e. intuitionistic logic without the ex falso principle, is investigated in its original form with a negation symbol instead of a symbol denoting the contradiction. A Kripke semantics is developed for minimal logic and its sublogics with a still weaker negation by introducing a function on the upward closed sets of the models. The basic logic is a logic in which the negation has...
متن کاملUnary negation
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the μcalculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semantics and Linguistic Theory
سال: 1992
ISSN: 2163-5951
DOI: 10.3765/salt.v2i0.3030